Balancing Neumann-Neumann preconditioners for mixed approximations of heterogeneous problems in linear elasticity
نویسندگان
چکیده
Abstract. Balancing Neumann-Neumann methods are extented to mixed formulations of the linear elasticity system with discontinuous coeÆcients, discretized with mixed nite or spectral elements with discontinuous pressures. These domain decomposition methods implicitly eliminate the degrees of freedom associated with the interior of each subdomain and solve iteratively the resulting saddle point Schur complement using a hybrid preconditioner based on a coarse mixed elasticity problem and local mixed elasticity problems with natural and essential boundary conditions. A polylogarithmic bound in the local number of degrees of freedom is proven for the condition number of the preconditioned operator in the constant coeÆcient case. Parallel and serial numerical experiments con rm the theoretical results, indicate that they still hold for systems with discontinuous coeÆcients, and show that our algorithm is scalable, parallel, and robust with respect to material heterogeneities. The results on heterogeneous general problems are also supported in part by our theory.
منابع مشابه
Positive definite balancing Neumann-Neumann preconditioners for nearly incompressible elasticity
In this paper, a positive definite Balancing Neumann-Neumann (BNN) solver for the linear elasticity system is constructed and analyzed. The solver implicitly eliminates the interior degrees of freedom in each subdomain and solves iteratively the resulting Schur complement, involving only interface displacements, using a BNN preconditioner based on the solution of a coarse elasticity problem and...
متن کاملBalancing Neumann-Neumann Preconditioners for the Mixed Formulation of Almost-Incompressible Linear Elasticity
Balancing Neumann-Neumann methods are extended to the equations arising from the mixed formulation of almost-incompressible linear elasticity problems discretized with discontinuous-pressure finite elements. This family of domain decomposition algorithms has previously been shown to be effective for large finite element approximations of positive definite elliptic problems. Our methods are prov...
متن کاملDomain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions
In this paper, we present several domain decomposition preconditioners for high-order Spectral Nédélec element discretizations for a Maxwell model problem in H(curl), in particular overlapping Schwarz preconditioners and Balancing Neumann-Neumann preconditioners. For an efficient and fast implementation of these preconditioners, fast matrix-vector products and direct solvers for problems posed ...
متن کاملBalancing Neumann-Neumann Methods for Elliptic Optimal Control Problems
We present Neumann-Neumann domain decomposition preconditioners for the solution of elliptic linear quadratic optimal control problems. The preconditioner is applied to the optimality system. A Schur complement formulation is derived that reformulates the original optimality system as a system in the state and adjoint variables restricted to the subdomain boundaries. The application of the Schu...
متن کاملGeneralized Neumann-neumann Preconditioners for Iterative Substructuring
One of the primary objective of domain decomposition methods is the eecient solution on parallel machines of problems in Computational Mechanics set on complex ge-ometries and approximated on very ne grids. In iterative substructuring, this objective is achieved by splitting the original domain of computation in smaller nonoverlapping simpler subdomains, and by reducing the initial problem to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 95 شماره
صفحات -
تاریخ انتشار 2003